Fundraising September 15, 2024 – October 1, 2024 About fundraising
1

A layout algorithm for data flow diagrams

Year:
1986
Language:
english
File:
PDF, 1.35 MB
english, 1986
2

A pointer-free data structure for merging heaps and min-max heaps

Year:
1991
Language:
english
File:
PDF, 1.37 MB
english, 1991
5

A faster computation of the most vital edge of a shortest path

Year:
2001
Language:
english
File:
PDF, 82 KB
english, 2001
6

Work-Related Stress Risk Assessment

Year:
2016
Language:
english
File:
PDF, 526 KB
english, 2016
11

Efficient secondary memory processing of window queries on spatial data

Year:
1995
Language:
english
File:
PDF, 698 KB
english, 1995
12

Efficient unbalanced merge–sort

Year:
2006
Language:
english
File:
PDF, 196 KB
english, 2006
14

Computing a poset from its realizer

Year:
1997
Language:
english
File:
PDF, 538 KB
english, 1997
16

Intersection reporting on two collections of disjoint sets

Year:
1999
Language:
english
File:
PDF, 592 KB
english, 1999
17

How to survive while visiting a graph

Year:
2000
Language:
english
File:
PDF, 156 KB
english, 2000
18

Finding the most vital node of a shortest path

Year:
2003
Language:
english
File:
PDF, 171 KB
english, 2003
20

Time and space efficient secondary memory representation of quadtrees

Year:
1997
Language:
english
File:
PDF, 1.11 MB
english, 1997
24

ATM layouts with bounded hop count and congestion

Year:
2001
Language:
english
File:
PDF, 169 KB
english, 2001
25

Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures

Year:
2004
Language:
english
File:
PDF, 261 KB
english, 2004
28

Probabilistic models for images and quadtrees: differences and equivalences

Year:
1999
Language:
english
File:
PDF, 142 KB
english, 1999
29

Modeling gene regulatory network motifs using statecharts

Year:
2012
Language:
english
File:
PDF, 934 KB
english, 2012
37

A Viewpoint on the Computing-Art Dialogue: The Classification of Interactive Digital Artworks

Year:
2014
Language:
english
File:
PDF, 429 KB
english, 2014